Counting tournament score sequences
نویسندگان
چکیده
The score sequence of a tournament is the out-degrees its vertices arranged in nondecreasing order. problem counting sequences with n n more than 100 years old [Quart. J. Math. 49 (1920), pp. 1–36]. In 2013 Hanna conjectured surprising and elegant recursion for these numbers. We settle this conjecture affirmative by showing that it corollary to our main theorem, which factorization generating function distinguished index. also derive closed formula quadratic time algorithm sequences.
منابع مشابه
Calculating the Frequency of Tournament Score Sequences
We indicate how to calculate the number of round-robin tournaments realizing a given score sequence. This is obtained by inductively calculating the number of tournaments realizing a score function. Tables up to 18 participants are obtained. 1. Tournaments and score sequences A (round-robin) tournament on a set P of n vertices (participants, teams, . . . ) is a directed graph obtained by orient...
متن کاملTransitive partitions in realizations of tournament score sequences
A tournament is an oriented complete graph, and one containing no directed cycles is called transitive. A tournament T= (V,A) is called m-partition transitive if there is a partition V=X1∪· X2∪· · · ·∪· Xm such that the subtournaments induced by each Xi are all transitive, and T Contract grant sponsor: University of Dayton Research Council (to A. H. B.); Contract grant sponsor: National Science...
متن کاملTournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 ≤ 2ti. A Meeussen sequence is an increasing sequence of positive integers (m1, m2, . . .) such that m1 = 1, every nonnegative integer is the sum of a subset of the {mi}, and each integer mi − 1 is the sum of a unique such subset. We show that these two properties are isomorphic. That i...
متن کامل0 Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 ≤ 2ti. A Meeussen sequence is an increasing sequence of positive integers (m1,m2, . . .) such that m1 = 1, every nonnegative integer is the sum of a subset of the {mi}, and each integer mi − 1 is the sum of a unique such subset. We show that these two properties are isomorphic. That is...
متن کاملMore on Counting Sequences
This note can be viewed as a logical continuation of our previous Note published earlier in the Monthly 1]. We shall repeat here, brieey, its main results to make the reading easier. A counting sequence S is a sequence of sequences fS i g 1 i=0 of positive integers. The sequence S i+1 is obtained from S i by counting the number m k of times an integer k occurs in S i and writing down in S i+1 t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2023
ISSN: ['2330-1511']
DOI: https://doi.org/10.1090/proc/16425